Characterization of the Existence of an N0-Completion of a Partial N0-Matrix with an Associated Directed Cycle
نویسندگان
چکیده
An n × n matrix is called an N 0-matrix if all its specified principal minors are nonpositive. In the context of partial matrices, a partial matrix is called a partial N 0-matrix if all its specified principal minors are nonpositive. In this paper we characterize the existence of an N 0-matrix completion of a partial N 0-matrix whose associated graph is a directed cycle.
منابع مشابه
completions on partial matrices ?
An n × n matrix is called an N0-matrix if all its principal minors are nonpositive. In this paper, we are interested in N0-matrix completion problems, that is, when a partial N0-matrix has an N0-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N0-matrix does not have an N0-matrix completion. Here, we prove that a combinatorially symmetric partial N0-matr...
متن کاملبررسی موارد عود بیماری در گردن در تومورهای دوسوم قدامی زبان رزکسیون شده بدون دیسکسیون الکتیو گردن در انستیتو کانسر بیمارستان امام خمینی 1379-1370
Regarding the prevalence of cancer in tongue and the management procedure of cases who have recurrence in cervical lymph nodes after partial glossectomy and in order to determine appropriate management of neck in early oral tongue cancer it was decided to conduct a study. A retrospective review of 62 patients with T1,2 N0 M0 SCC of the oral tongue treated by only partial glossectomy at Cancer I...
متن کاملOn Negative Inertia of Pick Matrices Associated with Generalized Schur Functions
It is known [6] that for every function f in the generalized Schur class Sκ and every nonempty open subset Ω of the unit disk D, there exist points z1, . . . , zn ∈ Ω such that the n × n Pick matrix h 1−f(zi)f(zj)∗ 1−ziz̄j in j,i=1 has κ negative eigenvalues. In this paper we discuss existence of an integer n0 such that any Pick matrix based on z1, . . . , zn ∈ Ω with n ≥ n0 has κ negative eigen...
متن کاملThe partial non - combinatorially symmetric N 10 - matrix completion problem
An n×n matrix is called an N 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially symmetric N 0 -matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N 0 -completion. Therefore, we have given sufficient conditions ...
متن کاملThe ideal completion is not sequentially adequate
It is well known that for the case of a countable partial order, the ideal completion and the chain completion coincide. We investigate the boundary at which the chain and ideal completion do not coincide. We show in particular that the ideal completion is not sequentially adequate; that is it is not possible in general to simply replace the ideal completion with a completion based on sequences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014